Search Results

Documents authored by Stege, Ulrike


Document
09142 Manifesto – Perspectives Workshop: Preventing the Brainware Crisis

Authors: Stephan Diehl and Ulrike Stege

Published in: Dagstuhl Seminar Proceedings, Volume 9142, Perspectives Workshop: Preventing the Brainware Crisis (2011)


Abstract
This manifesto summarizes the outcomes of the Dagstuhl Perspectives Workshop "Preventing the Brainware Crisis" held in Spring 2009. Our acquired goals are summarized by the following recommendations: to make computer science/computing science/informatics programs more attractive to women, to make curricula more engaging and interdisciplinary, and to make the public more aware of computer scientists’ work. We address specific audiences with particular recommendations and feature 10 tips on how to publicize computer science via the media.

Cite as

Stephan Diehl and Ulrike Stege. 09142 Manifesto – Perspectives Workshop: Preventing the Brainware Crisis. In Perspectives Workshop: Preventing the Brainware Crisis. Dagstuhl Seminar Proceedings, Volume 9142, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


Copy BibTex To Clipboard

@InProceedings{diehl_et_al:DagSemProc.09142.1,
  author =	{Diehl, Stephan and Stege, Ulrike},
  title =	{{09142 Manifesto – Perspectives Workshop: Preventing the Brainware Crisis}},
  booktitle =	{Perspectives Workshop: Preventing the Brainware Crisis},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2011},
  volume =	{9142},
  editor =	{Stephan Diehl and Michael R. Fellows and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09142.1},
  URN =		{urn:nbn:de:0030-drops-31434},
  doi =		{10.4230/DagSemProc.09142.1},
  annote =	{Keywords: Computer science education, outreach, people networking, enrolment crisis, schools}
}
Document
07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs

Authors: Erik Demaine, Gregory Z. Gutin, Daniel Marx, and Ulrike Stege

Published in: Dagstuhl Seminar Proceedings, Volume 7281, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs (2007)


Abstract
The following is a list of the problems presented on Monday, July 9, 2007 at the open-problem session of the Seminar on Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, held at Schloss Dagstuhl in Wadern, Germany.

Cite as

Erik Demaine, Gregory Z. Gutin, Daniel Marx, and Ulrike Stege. 07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Dagstuhl Seminar Proceedings, Volume 7281, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{demaine_et_al:DagSemProc.07281.2,
  author =	{Demaine, Erik and Gutin, Gregory Z. and Marx, Daniel and Stege, Ulrike},
  title =	{{07281 Open Problems – Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs}},
  booktitle =	{Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7281},
  editor =	{Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.2},
  URN =		{urn:nbn:de:0030-drops-12542},
  doi =		{10.4230/DagSemProc.07281.2},
  annote =	{Keywords: }
}
Document
07281 Abstracts Collection – Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs

Authors: Erik Demaine, Gregory Z. Gutin, Daniel Marx, and Ulrike Stege

Published in: Dagstuhl Seminar Proceedings, Volume 7281, Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs (2007)


Abstract
From 8th to 13th July 2007, the Dagstuhl Seminar ``Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Erik Demaine, Gregory Z. Gutin, Daniel Marx, and Ulrike Stege. 07281 Abstracts Collection – Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. In Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. Dagstuhl Seminar Proceedings, Volume 7281, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{demaine_et_al:DagSemProc.07281.1,
  author =	{Demaine, Erik and Gutin, Gregory Z. and Marx, Daniel and Stege, Ulrike},
  title =	{{07281 Abstracts Collection – Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs}},
  booktitle =	{Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7281},
  editor =	{Erik Demaine and Gregory Z. Gutin and Daniel Marx and Ulrike Stege},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07281.1},
  URN =		{urn:nbn:de:0030-drops-12450},
  doi =		{10.4230/DagSemProc.07281.1},
  annote =	{Keywords: Parameterized complexity, fixed-parameter tractability, graph structure theory}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail